Reachability problems in edge-colored digraphs
نویسندگان
چکیده
منابع مشابه
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compa...
متن کاملOn Edge-Colored Saturation Problems
Let C be a family of edge-colored graphs. A t-edge colored graph G is (C, t)saturated if G does not contain any graph in C but the addition of any edge in any color in [t] creates a copy of some graph in C. Similarly to classical saturation functions, define satt(n, C) to be the minimum number of edges in a (C, t) saturated graph. Let Cr(H) be the family consisting of every edge-colored copy of...
متن کاملČerný conjecture for edge-colored digraphs with few junctions
In this paper we consider the Cerny conjecture in terminology of colored digraphs corresponding to finite automata. We define a class of colored digraphs having a relatively small number of junctions between paths determined by different colors, and prove that digraphs in this class satisfy the Cerny conjecture. We argue that this yields not only a new class of automata for which the Cerny conj...
متن کاملMonochromatic paths on edge colored digraphs and state splittings
We look at the behavior under state splitting of distinct kinds of properties regarding monochromatic paths on edge colored digraphs. These are absorbance and independence as well as the existence of kernels, semikernels, quasikernels and Grundy functions, all of them defined in terms of monochromatic paths.
متن کاملPacking Problems in Edge-colored Graphs
Let F be a fixed edge-colored graph. We consider the problem of packing the greatest possible number of vertex disjoint copies of F into a given complete edge-colored graph. We observe that this problem is NP-hard unless F consists of isolated vertices and edges or unless there are only two colors and F is properly 2-edge-colored. Of the remaining problems we focus on the case where F is a prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.042